Computing the Greedy Spanner in Linear Space
نویسندگان
چکیده
منابع مشابه
\delta -Greedy t-spanner
We introduce a new geometric spanner, δ-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy spanner combines the most desirable properties of geometric spanners both in theory and in practice. More specifically, it has the same theoretical and practical properties as the Path-Greedy spanner: a natural definition, small degree, l...
متن کاملThe Weight of the Greedy Graph Spanner
We calculate a near-optimal upper bound on the weight of a graph spanner produced by the (so called) Greedy Spanner Algorithm on a weighted graph. Our upper bound is independent of the magnitude of the weights in the graph, and it matches the known lower bound up to a O(log(n)) for n-vertex graphs. We also update the bound on the size of the spanner, and bound above the weight of any non-MST ed...
متن کاملComputing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG) containing all suboptimal alignments. In this paper, we propose a method that computes such a DAG in space linear to the graph size. Let F be the area of the region of the dynamic-programming matrix bounded by the s...
متن کاملA Linear Space Algorithm for Computing the Hermite NormalFormDaniele
Computing the Hermite Normal Form of an n n matrix using the best current algorithms typically requires O(n 3 log M) space, where M is a bound on the length of the columns of the input matrix. Although polynomial in the input size (which is O(n 2 log M)), this space blow-up can easily become a serious issue in practice when working on big integer matrices. In this paper we present a new algorit...
متن کاملA Linear Space Algorithm for Computing the Hermite Normal Form
Computing the Hermite Normal Form of an n n integer matrix using the best urrent algorithms typi ally requires O(n3 logM) spa e, whereM is a bound on the entries of the input matrix. Although polynomial in the input size (whi h is O(n2 logM)), this spa e blow-up an easily be ome a serious issue in pra ti e when working on big integer matri es. In this paper we present a new algorithm for omputi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0001-2